An improved branch and bound algorithm for the maximum clique problem
نویسندگان
چکیده
A new algorithm for finding a maximum clique in an undirected graph is described. An approximate coloring algorithm has been improved and used to provide bounds to the size of the maximum clique in a basic algorithm which finds a maximum clique. This basic algorithm was then extended to include dynamically varying bounds. The resulting algorithm is significantly faster than the comparable algorithm. ∗ Author to whom correspondence should be addressed email: [email protected] telephone: 00386-14760200 fax: 00386-14760300 MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 58 (2007) 569-590
منابع مشابه
Faster Branch and Bound Algorithms for Solving the Maximum Clique Problem
We present efficient branch and bound algorithms for solving the Maximum Clique Problem. First strategy is to store the size of clique consisting of a seed vertex in a subset induced by candidate set of the seed vertex. Results stored are further used to reduce the computation involved in computing clique consisting of other seed vertices in another subset of the graph. This approach along with...
متن کاملImproving the Maximum-Weight Clique Algorithm for the Dense Graphs
In this paper we present a fast algorithm for the maximum-weight clique problem on arbitrary undirected graphs, which is improved for the dense graphs. The algorithm uses colour classes and backtracking techniques inside itself in parallel in a form of a branch and bound algorithm. The algorithm contains also several improvements for the most complex case, which are dense graphs. Computational ...
متن کاملSimple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of the...
متن کاملAn algorithm for nding amaximum clique in a graph
This paper introduces a branch-and-bound algorithm for the maximum clique problem which applies existing clique nding and vertex coloring heuristics to determine lower and upper bounds for the size of a maximum clique. Computational results on a variety of graphs indicate the proposed procedure in most instances outperforms leading algorithms. c © 1997 Elsevier Science B.V. All rights reserved.
متن کاملA Branch and Bound Algorithm for Matching Protein Structures
An efficient branch and bound algorithm for matching protein structures has been developed. The compared protein structures are represented as graphs and a product graph of these graphs is calculated. The resulting product graph is then the input to our algorithm. A maximum clique in the product graph corresponds to the maximum common substructure in the original graphs. Our algorithm, which gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007